Generalized intransitive dice II: Partition constructions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Breaking Verbs in French: Two Intransitive Constructions

In Cognitive Linguistics, meaning resides in conceptual-ization and grammar is seen as being meaningful. Cog-nitive semantics provides an array of well-motivated de-scriptive constructs allowing a revealing description ofsemantic and grammatical structure. The linguist ev-idence sheds light on human conceptual abilities thatneed to be accommodated in models of cognitive ...

متن کامل

Generating Paraphrases of Human Intransitive Adjective Constructions with Port4NooJ

This paper details the integration into Port4NooJ of 15 lexicon-grammar tables describing the distributional properties of 4,248 human intransitive adjectives. The properties described in these tables enable the recognition and generation of semantico-syntactically equivalent adjectival constructions where the adjective has a predicative function. These properties also establish semantic relati...

متن کامل

On the parity of generalized partition functions II

Improving on some results of J.-L. Nicolas [15], the elements of the set A = A(1+ z+ z + z + z), for which the partition function p(A, n) (i.e. the number of partitions of n with parts in A) is even for all n ≥ 6 are determined. An asymptotic estimate to the counting function of this set is also given.

متن کامل

Probabilistic constructions in generalized quadrangles

We study random constructions in incidence structures, and illustrate our techniques by means of a well-studied example from finite geometry. A maximal partial ovoid of a generalized quadrangle is a maximal set of points no two of which are collinear. The problem of determining the smallest size of a maximal partial ovoid in quadrangles has been extensively studied in the literature. In general...

متن کامل

Constructions of generalized Sidon sets

We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k = s1 + s2, si ∈ S; such sets are called Sidon sets if g = 2 and generalized Sidon sets (or B2[ ⌈ g/2 ⌉ ] sets) if g ≥ 3. We extend to generalized Sidon sets the Sidon-set constructions of Singer, Bose, and Ruzsa. We also further optimize Koulantzakis’ idea of interleaving sever...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Dynamics & Games

سال: 2021

ISSN: 2164-6074

DOI: 10.3934/jdg.2021005